Improving table compression with combinatorial optimization
نویسندگان
چکیده
منابع مشابه
2 Improving Table Compression with Combinatorial Optimization ∗
We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA’00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on part...
متن کاملImproving combinatorial optimization
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In this thesis, we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint projection th...
متن کاملImproving Combinatorial Optimization - Extended Abstract
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint pr...
متن کاملCompression of Image Contours using Combinatorial Optimization
Compression of image contours is an important problem in many contexts. An example is object oriented video coding, where eecient encoding of shape information of arbitrarily shaped objects is a major problem. This paper presents a method for compressing contours by extracting representative points from the original curve. By formulating the point selection problem as a graph theory problem, kn...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2003
ISSN: 0004-5411,1557-735X
DOI: 10.1145/950620.950622